The article discusses the evolution of concurrency models in programming, particularly the shift from thread-per-core to work-stealing approaches in async programming. It highlights the implications of increased core counts and the need for dynamic reshuffling in data processing, suggesting that shared-state concurrency is regaining popularity due to improved IO latency and the necessity for systems to handle skew effectively at scale.